Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
نویسندگان
چکیده
This paper presents four algorithms for securing elliptic curve scalar multiplication against power analysis. The highest-weight binary form (HBF) of scalars and randomization are applied to resist power analysis. By using a special method to recode the scalars, the proposed algorithms do not suffer from simple power analysis (SPA). With the randomization of the secret scalar or base point, three of the four algorithms are secure against differential power analysis (DPA), refined power analysis (RPA) and zero-value point attacks (ZPA). The countermeasures are also immune to the doubling attack. Fast Shamir’s method is used in order to improve the efficiency of parallel scalar multiplication. Compared with previous countermeasures, the new countermeasures achieve higher security and do not impact overall performance. 2007 Elsevier Inc. All rights reserved.
منابع مشابه
Randomized Scalar Multiplication Algorithm against Power Analysis Attacks
Nowadays, power analysis attacks are becoming more and more advanced. Compared with any other kind of physical attacks, power analysis attacks are more efficient for attacker to obtain secret data stored in smart cards or other embedded devices. Among power analysis attacks, Simple Power Analysis (SPA) and Differential Power Analysis (DPA) are the two main attacks on the elliptic curve cryptosy...
متن کاملEfficient Comb Elliptic Curve Multiplication Methods Resistant to Power Analysis
Elliptic Curve Cryptography (ECC) has found wide applications in smart cards and embedded systems. Point multiplication plays a critical role in ECC. Many efficient point multiplication methods have been proposed. One of them is the comb method [5] which is much more efficient than other methods if precomputation points are calculated in advance or elsewhere. Unfortunately, Many efficient point...
متن کاملA Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملFaster Side-Channel Resistant Elliptic Curve Scalar Multiplication
We present a new point scalar multiplication algorithm on classical Weierstrass elliptic curves over fields of characteristic greater than 3. Using Meloni’s formula that efficiently adds two points with the same Z-coordinates, we develop an algorithm computing [k]P only with these point additions. We combine Meloni’s addition with a modified version of a Montgomery ladder, a well-established si...
متن کاملParallel scalar multiplication on general elliptic curves over Fp hedged against Non-Differential Side-Channel Attacks
For speeding up elliptic curve scalar multiplication and making it secure against side-channel attacks such as timing or power analysis, various methods have been proposed using speci cally chosen elliptic curves. We show that both goals can be achieved simultaneously even for conventional elliptic curves over Fp . This result is shown via two facts. First, we recall the known fact that every e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 177 شماره
صفحات -
تاریخ انتشار 2007